Bottom-up computation of recursive programs

Bottom-up Evaluation of Finitely Recursive Queries

The support for function symbols in logic programming under Answer Set Programming semantics (ASP) allows to overcome some modeling limitations of traditional ASP systems, such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Thus, the research is lately focusing on finding proper subclasses of A...

Bottom-up induction of logic programs with more than one recursive clause

In this paper we present a bottom-up algorithm called MRI to induce logic programs from their examples. This method can induce programs with a base clause and more than one recursive clause from a very small number of examples. MRI is based on the analysis of saturations of examples. It rst generates a path structure, which is an expression of a stream of values processed by predicates. The con...

On the bottom - up evaluation of recursive queries

In this paper, we present an optimal bottom-up evaluation method for handling both linear and non-linear recursion. Based on the well-known magic-set method, we develop a technique: labelling to record the cyclic paths during the execution of the first phase of the magic-set method and suspending the computation for the cyclic data in the second phase to avoid the redundant evaluation. Then we ...

Characterizing Recursive Programs up to Bisimilarity

A recursive program is determined, up to bisimilarity, by the operation of the recursion body on arbitrary processes, of which it is a fixpoint. The traditional proof of this fact uses Howe’s method, but that does not tell us how the fixpoint is obtained. In this paper, we show that the fixpoint may be obtained by a least fixpoint procedure iterated through the hierarchy of countable ordinals, ...

Transformation-Based Bottom-Up Computation Of The Well-Founded Model